Affine extractors over large fields with exponential error
نویسندگان
چکیده
منابع مشابه
Extractors for Affine Sources with Polylogarithmic Entropy
We give the first explicit construction of deterministic extractors for affine sources over F2, with entropy k ≥ log n for some large enough constant C, where n is the length of the source. Previously the best known results are by Bourgain [Bou07], Yehudayoff [Yeh11] and Li [Li11b], which require the affine source to have entropy at least Ω(n/ √ log log n). Our extractor outputs one bit with er...
متن کاملAffine Nash groups over real closed fields
We prove that a semialgebraically connected affine Nash group over a real closed field R is Nash isogenous to the semialgebraically connected component of the group H(R) of R-points of some algebraic group H defined over R. In the case when R = R this result was claimed in [5], but a mistake in the proof was recently found, and the new proof we obtained has the advantage of being valid over an ...
متن کاملAffine circle geometry over quaternion skew fields
We investigate the affine circle geometry arising from a quaternion skew field and one of its maximal commutative subfields.
متن کاملError Reduction for Extractors
We present a general method to reduce the error of any extractor. Our method works particularly well in the case that the original extractor extracts up to a constant fraction of the source min-entropy and achieves a polynomially small error. In that case, we are able to reduce the error to (almost) any ", using only O(log(1=")) additional truly random bits (while keeping the other parameters o...
متن کاملError Reduction in Extractors
We present a general method to reduce the error of any extractor. Our method works particularly well in the case that the original extractor extracts up to a constant fraction of the source min-entropy and achieves a polynomially small error. In that case, we are able to reduce the error to (almost) any ε, using only O(log(1/ε)) additional truly random bits (while keeping the other parameters o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2015
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-015-0108-5